Transposing partial components—An exercise on coalgebraic refinement
نویسندگان
چکیده
منابع مشابه
Transposing partial components - An exercise on coalgebraic refinement
A partial component is a process which fails or dies at some stage, thus exhibiting a finite, more ephemeral behaviour than expected (e.g. operating system crash). Partiality — which is the rule rather than exception in formal modelling — can be treated mathematically via totalization techniques. In the case of partial functions, totalization involves error values and exceptions. In the context...
متن کاملEfficient Coalgebraic Partition Refinement
We present a generic partition refinement algorithm that quotients coalgebraic systems by behavioural equivalence, an important task in reactive verification; coalgebraic generality implies in particular that we cover not only classical relational systems but also various forms of weighted systems. Under assumptions on the type functor that allow representing its finite coalgebras in terms of n...
متن کاملA Single Complete Relational Rule for Coalgebraic Refinement
A transition system can be presented either as a binary relation or as a coalgebra for the powerset functor, each representation being obtained from the other by transposition. More generally, a coalgebra for a functor F generalises transition systems in the sense that a shape for transitions is determined by F, typically encoding a signature of methods and observers. This paper explores such a...
متن کاملBehaviour-Refinement of Coalgebraic Specifications with Coinductive Correctness Proofs
A notion of reenement is deened in the context of coalgebraic spec-iication of classes in object-oriented languages. It tells us when objects in a \concrete" class behave exactly like (or: simulate) objects in an \abstract" class. The deenition of reenement involves certain selection functions between procedure-inputs and attribute-outputs, which gives this notion considerable exibility. The co...
متن کاملOn a New Notion of Partial Refinement
Formal specification techniques allow expressing idealized specifications, which abstract from restrictions that may arise in implementations. However, partial implementations are universal in software development due to practical limitations. Our goal is to contribute to a method of program refinement that allows for partial implementations. For programs with a normal and an exceptional exit, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2006
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2006.07.030